Attack analysis of cryptographic protocols using strand spaces

نویسندگان

  • S. A. Lukell
  • A. C. M. Hutchison
چکیده

Network security protocols make use of cryptographic techniques to achieve goals such as confidentiality, authentication, integrity and non-repudiation. However, the fact that strong cryptographic algorithms exist does not guarantee the security of a communications system. In fact, it is recognised that the engineering of security protocols is a very challenging task, since protocols that appear secure can contain subtle flaws and vulnerabilities that attackers can exploit. A number of techniques exist for the analysis of security protocol specifications. Each of the techniques currently available is not capable of detecting every possible flaw or attack against a protocol when used in isolation. However, when combined, these techniques all complement each other and allow a protocol engineer to obtain a more accurate overview of the security of a protocol that is being designed. This fact, amongst others, is the rationale for multi-dimensional security protocol engineering, a concept introduced by previous projects in the DNA group. We propose an attack construction approach to security protocol analysis within a multi-dimensional context. This analysis method complements the method used in the existing inference construction analysis tools developed earlier in the group. This paper gives a brief overview of the concepts associated with our project, including a summary of existing security protocol analysis techniques, and a description of the strand space model, which is the intended formalism for the analysis.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Key Compromise, Strand Spaces, and the Authentication Tests

Some cryptographic protocols are vulnerable to replay attacks, a type of weakness that was a focus of attention in the Burroughs-Abadi-Needham logic. Newer, more operational approaches to protocol analysis have not concentrated on this type of attack. This paper fills the gap for the strand space theory. The main technical point is to provide a definition of recency. Our candidate is convenient...

متن کامل

Fairness analysis of e-commerce protocols based on strand spaces

Strand space logic is a formal method for analysing the security protocol. The electronic commerce protocols are of more complex structures, for example, branch structures, or a protocol is composite of multiple sub-protocols, so the analysis of electronic commerce protocols is far more complex than the analysis of authentication protocols. Fairness is a very important feature in ecommerce prot...

متن کامل

A Comparison between Strand Spaces and Multiset Rewriting for Security Protocol Analysis

Formal analysis of security protocols is largely based on a set of assumptions commonly referred to asthe Dolev-Yao model. Two formalisms that state the basic assumptions of this model are related here:strand spaces and multiset rewriting with existential quantification. Strand spaces provide a simple andeconomical approach to analysis of completed protocol runs by emphasizing causa...

متن کامل

Analysing TLS Using the Strand Spaces Model

In this paper, we analyse the Transport Layer Security (TLS) protocol within the strand spaces setting. In [BL03] Broadfoot and Lowe suggested an abstraction of TLS. The abstraction models the security services that appear to be provided by the protocol to the high-level security layers. The outcome of our analysis provides a formalisation of the security services provided by TLS and proves tha...

متن کامل

Relating Strand Spaces and Distributed Temporal Logic for Security Protocol Analysis

In previous work, we introduced a version of distributed temporal logic that is well-suited both for verifying security protocols and as a metalogic for reasoning about, and relating, different security protocol models. In this paper, we formally investigate the relationship between our approach and strand spaces, which is one of the most successful and widespread formalisms for analyzing secur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • South African Computer Journal

دوره 31  شماره 

صفحات  -

تاریخ انتشار 2003